Diversifying top-k results

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diversifying Top-K Results

Top-k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other. In practice, some of the top-k results returned can be very similar to each other. As a result some of the top-k results returned are redundant. In the literature, diversified top-k search has been studied to return k res...

متن کامل

Diversifying Query Suggestion Results

In order to improve the user search experience, Query Suggestion, a technique for generating alternative queries to Web users, has become an indispensable feature for commercial search engines. However, previous work mainly focuses on suggesting relevant queries to the original query while ignoring the diversity in the suggestions, which will potentially dissatisfy Web users’ information needs....

متن کامل

Diversifying Search Results Using Time

For our evaluation setup we considered three categories of history-oriented queries: categories of history-oriented queries : long-lasting wars, recurring events, and famous personalities. For constructing the queries we utilized reliable sources on the Web and data presented in prior research articles [2, 3]. We describe the details next. Queries for long-lasting wars were constructed from the...

متن کامل

Diversifying Search Results Using Semantic Resources

In the last years, multimedia content has grown increasingly over the Internet, especially in social networks (like Facebook or Flickr), where users often post images using their mobile devices. In these networks, the content is later used in search operations, when some users want to find something using a specific query. Nowadays, searching into these networks is primarily made using the titl...

متن کامل

Top k Knapsack Joins and Closure Preliminary Results

We call knapsack join (KS-Join) the join under the condition that the sum of the join attributes is at most some constant. The knapsack closure is the related transitive closure. Both operations appear interesting to the financial community. The constant is typically a budget. The join attributes are possible expenditures, to be chosen from large sets. Usually only the Top k tuples of the KS-Jo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the VLDB Endowment

سال: 2012

ISSN: 2150-8097

DOI: 10.14778/2350229.2350233